Hybrid Solving for Quantified Boolean Formulas Based on SVM and Reinforcement Learning ⋆
نویسندگان
چکیده
In this paper, a new SVM classification algorithm is proposed, this algorithm is applied in Quantified Boolean Formulas (QBF) hybrid solving and a new QBF hybrid solver is designed. This solver apply SVM algorithm to construct inductive models and classify the formulae. At the same time, the reinforcement learning technology is applied to realize the dynamic algorithm selection. The relationship between the solving algorithm and formula is established according to test formula set and Run-time performance. When the first heuristic fails in resolving the formula, the Reinforcement Learning procedure can select another solving algorithm automatically. It can drastically improve the performance of a QBF solver and resolve more numerous formulas than sequential QBF Solver. It proved that non-linear prediction models based on SVM and the reinforcement learning are very useful in formulae classification and online algorithm switch. It is believed that machine learning technology can be helpful to a much larger degree when solving hard problems.
منابع مشابه
Solving Quantified Boolean Formulas
Solving Quantified Boolean Formulas Horst Samulowitz Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2007 Many real-world problems do not have a simple algorithmic solution and casting these problems as search problems is often not only the simplest way of casting them, but also the most efficient way of solving them. In this thesis we will present several tec...
متن کاملLearning to Solve QBF
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with machine learning techniques. We show how classification methods can be used to predict run-times and to choose optimal heuristics both within a portfolio-based, and within a dynamic, online approach. In the dynamic method variables are set to a truth value according to a scheme ...
متن کاملContributions to the Theory of Practical Quantified Boolean Formula Solving
Recent solvers for quantified boolean formulas (QBFs) use a clause learning method based on a procedure proposed by Giunchiglia et al. (JAIR 2006), which avoids creating tautological clauses. The underlying proof system is Q-resolution. This paper shows an exponential worst case for the clause-learning procedure. This finding confirms empirical observations that some formulas take mysteriously ...
متن کاملAssessing the impact of Learning Techniques in Quantified Boolean Logic Satisfiability
Learning, i.e., the ability to record and exploit some information which is unveiled during the search, proved to be a very effective AI technique for problem solving and, in particular, for constraint satisfaction. In (Giunchiglia et al. 2002) we have introduced learning as a general purpose technique to improve the performances of decision procedures for Quantified Boolean Formulas (QBFs). We...
متن کاملiDQ: Instantiation-Based DQBF Solving
Dependency Quantified Boolean Formulas (DQBF) are obtained by adding Henkin quantifiers to Boolean formulas and have seen growing interest in the last years. Since deciding DQBF is NExpTime-complete, efficient ways of solving it would have many practical applications. Still, there is only few work on solving this kind of formulas in practice. In this paper, we present an instantiation-based tec...
متن کامل